Factorization of bivariate sparse polynomials
نویسندگان
چکیده
منابع مشابه
Factoring bivariate sparse (lacunary) polynomials
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their multiplicities, whose running time is polynomial in the bit length of the sparse encoding of the input and in d . Moreover, we show that the factors over Q of degree ≤ d which are not binomials can also be computed in tim...
متن کاملHybrid Sparse Resultant Matrices for Bivariate Polynomials
We study systems of three bivariate polynomials whose Newton polygons are scaled copies of a single polygon. Our main contribution is to construct square resultant matrices, which are submatrices of those introduced by Cattani et al. (1998), and whose determinants are nontrivial multiples of the sparse (or toric) resultant. The matrix is hybrid in that it contains a submatrix of Sylvester type ...
متن کاملAlgebraic Osculation and Factorization of Sparse Polynomials
We prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of C and D an effective divisor with support ∂X = X \ C. Our main result gives explicit conditions equivalent to that a given Cartier divisor on the subscheme (|D|,OD) extends to X. These osculation criterions are expressed with residu...
متن کاملAn Algorithm for Approximate Factorization of Bivariate Polynomials
In this paper, we propose a new numerical method for factoring approximate bivariate polynomials over C. The method relies on Ruppert matrix and singular value decomposition. We also design a new reliable way to compute the approximate GCD of bivariate polynomials with floating-point coefficients. The algorithm has been implemented in Maple 9. The experiments show that the algorithms are very e...
متن کاملSparse multivariate factorization by mean of a few bivariate factorizations
We describe an algorithm to factor sparse multivariate polynomials usingO(d) bivariate factorizations where d is the number of variables. This algorithm is implemented in the Giac/Xcas computer algebra system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2019
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa171219-18-12